Recursive Decentralized Collaborative Localization for Sparsely Communicating Robots

نویسندگان

  • Lukas Luft
  • Tobias Schubert
  • Stergios I. Roumeliotis
  • Wolfram Burgard
چکیده

This paper provides a new fully-decentralized algorithm for Collaborative Localization based on the extended Kalman filter. The major challenge in decentralized collaborative localization is to track inter-robot dependencies – which is particularly difficult in situations where sustained synchronous communication between robots cannot be guaranteed. Current approaches suffer from the need for particular communication schemes, extensive bookkeeping of measurements, overlyconservative assumptions, or the restriction to specific measurement models. To the best of our knowledge, the algorithm we propose in this paper is the first one that tracks interrobot correlations while fulfilling all of the following relevant conditions: communication is limited to two robots that obtain a relative measurement, the algorithm is recursive in the sense that it does not require storage of measurements and each robot maintains only the latest estimate of its own pose, and it supports generic measurement models. These particularly hard conditions make the approach applicable to a wide range of multi-robot applications. Extensive experiments carried out using real world datasets demonstrate the improved performance of our method compared to several existing approaches.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decentralized Cooperative SLAM for Sparsely-Communicating Robot Networks: A Centralized-Equivalent Approach

Communication between robots is key to performance in cooperative multi-robot systems. In practice, communication connections for information exchange between all robots are not always guaranteed, which adds difficulty in performing state estimation. This paper examines the decentralized cooperative simultaneous localization and mapping (SLAM) problem, in which each robot is required to estimat...

متن کامل

Synergetic Localization for Groups of Mobile Robots

In this paper we present a new approach to the problem of simultaneously localizing a group of mobile robots capable of sensing each other. Each of the robots collects sensor data regarding its own motion and shares this information with the rest of the team during the update cycles. A single estimator, in the form of a Kalman lter, processes the available positioning information from all the m...

متن کامل

Map-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots

In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...

متن کامل

Multiagent Coordination by Stochastic Cellular Automata

A coordination mechanism for a system of sparsely communicating agents is described. The mechanism is based on a stochastic version of cellular automata. A parameter similar to a temperature can be tuned to change the behaviour of the system. It is found that the best coordination occurs near a phase transition between order and chaos. Coordination does not rely on any particular structure of t...

متن کامل

Collaborative Multi-Robot Monte Carlo Localization in Assistant Robots

This paper presents an algorithm for collaborative mobile robot localization based on probabilistic methods (Monte Carlo localization) used in assistant robots. When a root detects another in the same environment, a probabilistic method is used to synchronize each robot’s belief. As a result, the robots localize themselves faster and maintain higher accuracy. The technique has been implemented ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016